Grammar Characterization of Flowgraphs
نویسندگان
چکیده
Introduction Several attempts to handle program schemes as mathematical entities have been made in recent years, in an effort to develop algebraic techniques covering program optimization, debugging, verification, and classification [l31. The studies in this area tend to follow two different approaches, according to the two fundamental aspects of a program, i.e., its control flow [4] and its semantic contents [2].
منابع مشابه
Chart Parsing of Flowgraphs
This paper will present a generalisation of chart parsing able to cope with the case where the object being parsed is a particular kind of diagram (a flowgraph) and the grammar is an appropriate type of graph grammar (a flowgraph grammar). A feature that often occurs in such diagrams is structure sharing. This paper also discusses the problem of diagram recognition in the case where structure s...
متن کاملAnnotation Inference for Safety Certification of Automatically Generated Code
ed Control FlowGraphs. The algorithm uses abstracted control flow graphs (CFGs), in which code fragments matching specific patterns are collapsed into individual nodes. Since the patterns can depend on the variables, separate abstracted CFGs must be constructed for
متن کاملAsymptotic Enumeration of Predicate-Junction Flowgraphs
We consider unlabelled flowgraphs for a model of binary logic without the constraints of structured programming. The number of such flowgraphs is asymptotic to (3.4n)n/2, where n is the number of nodes in the flowgraph. This is to be compared with bounds of between (8.8)n/2 and of (9.8)n/2 for unlabelled structured flowgraphs of the Böhm and Jacopini type. Of the space of flowgraphs we study, 4...
متن کاملA Solution to the Flowgraphs Case Study using Triple Graph Grammars and eMoflon
After 20 years of Triple Graph Grammars (TGGs) and numerous actively maintained implementations, there is now a need for challenging examples and success stories to show that TGGs can be used for real-world bidirectional model transformations. Our primary goal in recent years has been to increase the expressiveness of TGGs by providing a set of pragmatic features that allow a controlled fallbac...
متن کاملAlternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IBM Journal of Research and Development
دوره 24 شماره
صفحات -
تاریخ انتشار 1980